Constructions of nested directed BIB designs

نویسندگان

  • Miwako Mishima
  • Ying Miao
  • Sanpei Kageyama
  • Masakazu Jimbo
چکیده

A directed BIB design DB(k, A; v) is a BIB design B(k, 2A; v) in which the blocks are transitively ordered k-tuples and each ordered pair of elements occurs in exactly A blocks. A nested directed BIB design NDB(k, A; v) of form IT2<n<k-l(njn, An)in is a DB(k, A; v) where each block contains E2<n<k-l injn mutually disjoint subblocks, injn subblocks of which are partitIoned into in mutually disjoint families of jn subblocks of size nand the jn subblocks of size n belong to one distinguished system which forms the collection of blocks of a DB(n, An; v). In this paper we will use known and new techniques to show the existence of all NDB(k, A; v) of the form IT2SnSk-l (n jn , An)in for k = 4 and 5. Australasian Journal of Combinatorics 18(1998), pp.157-172

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Patterned Constructions of Rectangular Designs

This paper describes some new patterned methods of constructing rectangular designs from balanced incomplete block (BIB) designs and nested BIB designs, and gives a table of rectangular designs in the range of r, k ≤ 10.

متن کامل

Pairwise additive 1-rotational BIB designs with λ=1

The existence of pairwise additive balanced incomplete block (BIB) designs and pairwise additive cyclic BIB designs with λ = 1 has been discussed through direct and recursive constructions in the literature. This paper takes BIB designs with 1-rotational automorphisms and then the existence of pairwise additive 1-rotational BIB designs is investigated for λ = 1. Finally, it is shown that there ...

متن کامل

Good equidistant codes constructed from certain combinatorial designs

An (n,M, d; q) code is called equidistant code if the Hamming distance between any two codewords is d. It was proved that for any equidistant (n,M, d; q) code, d nM(q − 1)/(M − 1)q(= dopt, say). A necessary condition for the existence of an optimal equidistant code is that dopt be an integer. If dopt is not an integer, i.e. the equidistant code is not optimal, then the code with d = dopt is cal...

متن کامل

1 9 Ja n 20 04 DIFFERENCE METHODS AND FERRERO PAIRS

We present a construction method of BIB-designs from a finite group G and a group of automorphisms Φ on G such that |Φ(x)| = |Φ| for all x ∈ G, x = 0. By using a generalization of the concept of a difference family we can so unify several previous constructions of BIB-designs from planar near-rings.

متن کامل

Balanced Nested Designs and Balanced n-ary Designs

We introduce here two types of balanced nested designs (BND), which are called symmetric and pair-sum BNDs. In this paper, we give a construction for pair-sum BNDs of BIBDs from nested BIBDs and perpendicular arrays. We also give some direct constructions for pair-sum BNDs of BIBDs, based on the result obtained by Wilson (1972). By use of these constructions, we show some constructions for regu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 18  شماره 

صفحات  -

تاریخ انتشار 1998